Solvable Primitive Permutation Groups of Low Rank

Primitive Permutation Groups of Finite Morley Rank

We prove a version of the O'Nan-Scott Theorem for detinably primitive permutation groups of finite Morley rank. This yields questions about structures of finite Morley rank of the form (F, + , . , / / ) where (F, +,.) is an algebraically closed field and H is a central extension of a simple group with /Y=sGL(rt, F). We obtain partial results on such groups H, and show for example that if char(/...

The Minimal Base Size of Primitive Solvable Permutation Groups

A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. Answering a question of Pyber, we prove that all primitive solvable permutation groups have a base of size at most four.

Distinguishing Primitive Permutation Groups

Let G be a permutation group acting on a set V . A partition π of V is distinguishing if the only element of G that fixes each cell of π is the identity. The distinguishing number of G is the minimum number of cells in a distinguishing partition. We prove that if G is a primitive permutation group and |V | ≥ 336, its distinguishing number is two.

Factorizations of Primitive Permutation Groups

On solvable minimally transitive permutation groups

We investigate properties of finite transitive permutation groups (G, Ω) in which all proper subgroups of G act intransitively on Ω. In particular, we are interested in reduction theorems for minimally transitive representations of solvable groups.